Termination w.r.t. Q proof of TRS/SK902.54.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a) → x
f(x, g(y)) → f(g(x), y)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a) → x
f(x, g(y)) → f(g(x), y)

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

f₂ > g₁
a > g₁

Status:

a: multiset
f₂: [2,1]
g₁: [1]